No NP problems averaging over ranking of distributions are harder
نویسندگان
چکیده
منابع مشابه
0 Most Tensor Problems are NP - Hard
We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list here includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor possesses a given eigenvalue, singular value, or spectral norm; approximating an eigenvalue, eigenvector, singular vector, or the spectral norm; and determi...
متن کاملYet harder knapsack problems
Already 30 years ago, Chvátal has shown that some instances of the zero-one knapsack problem cannot be solved in polynomial time using a particular type of branch-and-bound algorithms based on relaxations of linear programs together with some rudimentary cutting-plane arguments as bounding rules. We extend this result by proving an exponential lower bound in a more general class of branch-and-b...
متن کاملSVP is no harder than CVP
We write A ≤T B to denote that A is Turing-reducible to B; A is Turing-reducible to a problem B if given an oracle for B, one can compute answers to A. In this case we will show taht if we can compute correct answers for CV Pγ , we can use this to compute the γ-shortest vector of some fixed lattice. Note that the decision formulation of CV P is NP-hard while (the natural decision version of) SV...
متن کاملThe median problems for breakpoints are NP-complete
The breakpoint distance between two n-permutations is the number of pairs that appear consecutively in one but not in the other. In the median problem for breakpoints one is given a set of permutations and has to construct a permutation that minimizes the sum of breakpoint distances to all the original ones. Recently, the problem was suggested as a model for determining the evolutionary history...
متن کاملCombinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
We introduce a new general polynomial-time constructionthe fibre constructionwhich reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction problem CSP(P), where P is any subprojective relational system. As a consequence we get a new proof (not using universal algebra) that CSP(P) is NP -complete for any subprojective (and thus also projective) relational system. The fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00272-1